t=int(input())
for j in range(t):
input()
xa,ya=[int(i) for i in input().split()]
xb,yb=[int(i) for i in input().split()]
xf,yf=[int(i) for i in input().split()]
if not ((xa==xb==xf and (ya<yf<yb or ya>yf>yb)) or (ya==yb==yf and (xa<xf<xb or xa>xf>xb))):
print(abs(xa-xb)+abs(ya-yb))
else:
print(abs(xa-xb)+abs(ya-yb)+2)#include<bits/stdc++.h>
using namespace std;
void solve()
{
int xa,ya,xb,yb,fa,fb;
cin >> xa >> ya >> xb >> yb >> fa >> fb;
int res=abs(xa-xb)+abs(ya-yb);
if(xa==xb&&xa==fa)
{
if((ya>fb&&yb<fb)||(ya<fb&&yb>fb)) res+=2;
}
if(ya==yb&&yb==fb)
{
if((xa>fa&&xb<fa)||(xa<fa&&xb>fa)) res+=2;
}
cout << res << endl;
}
int main()
{
int _;
cin >> _;
while(_--)
{
solve();
}
}1547B - Alphabetical Strings | 1550A - Find The Array |
118B - Present from Lena | 27A - Next Test |
785. Is Graph Bipartite | 90. Subsets II |
1560A - Dislike of Threes | 36. Valid Sudoku |
557. Reverse Words in a String III | 566. Reshape the Matrix |
167. Two Sum II - Input array is sorted | 387. First Unique Character in a String |
383. Ransom Note | 242. Valid Anagram |
141. Linked List Cycle | 21. Merge Two Sorted Lists |
203. Remove Linked List Elements | 733. Flood Fill |
206. Reverse Linked List | 83. Remove Duplicates from Sorted List |
116. Populating Next Right Pointers in Each Node | 145. Binary Tree Postorder Traversal |
94. Binary Tree Inorder Traversal | 101. Symmetric Tree |
77. Combinations | 46. Permutations |
226. Invert Binary Tree | 112. Path Sum |
1556A - A Variety of Operations | 136. Single Number |